Planar Interchangeable 2-terminal Routing
نویسندگان
چکیده
abstract Many practical routing problems such as BGA, PGA and test xture routing involve routing two-terminal nets on a plane with exchangeable pins. In this paper, we unify these diierent problems as instances of the Planar Interchangeable 2-Terminal Routing (PI2TR) problem. We formulate the problem as ows in a routing network. Secondly, we show that PI2TR is NP-complete by reduction from satissability. Finally, we show experimental evidence that a simple min-cost ow heuristic considering only the most important cuts in the design can quickly produce routable results in most practical cases. The ow formulation can be generalized to multiple layers with no additional vias.
منابع مشابه
Two NP-hard interchangeable terminal problems
Two subproblems that arise when routing channels with interchangeable terminals are shown to be NP-hard. These problems are: P1: Is there a net to terminal assignment that results in an acyclic vertical constraint graph? P2: For instances with acyclic vertical constraint graphs, obtain net to terminal assignments for which the length of the longest path in the vertical constraint graph is minimum.
متن کاملSingle phase three-layer channel routing algorithms
We present a simple three-layer assignment algorithm for planar layouts generated by a class of layout algorithms. This class of algorithms includes simple variations of the following algorithms developed by Mehlhorn et al. (1986): (i) The algorithm that generates planar layouts for the two-terminal net CRP with dmax tracks. (ii) The algorithm that generates planar layouts for the twoand three-...
متن کاملMUL'I'-PADs, SINGLE LAYER POWER NETT ROUTING IN VLSI CIRCUITS
An algorithm is presented for obtaining a planar routing of two power nets in building-block layout. In contrast to other works, more than one pad for each of the power nets is allowed. First, conditions are established to guarantee a planar routing. The algorithm consists of three parts, a top-down terminal clustering, a bottom-up topological path routing and a wire width calculation procedure...
متن کاملA provably good multilayer topological planar routing algorithm in IC layout designs
Given a number of routing layers, the multilayer topological planar routing problem is to choose a maximum (weighted) set of nets so that each net in the set can be topologically routed entirely in one of the given layers without crossing other nets. This problem has important application in the layout design of multilayer IC technology, which has become available recently. In this paper, we pr...
متن کاملVertex Disjoint Paths for Dispatching in Railways
We study variants of the vertex disjoint paths problem in planar graphs where paths have to be selected from a given set of paths. We study the problem as a decision, maximization, and routingin-rounds problem. Although all considered variants are NP-hard in planar graphs, restrictions on the location of the terminals, motivated by railway applications, lead to polynomially solvable cases for t...
متن کامل